A rigid Boolean algebra that admits the elimination of Q21

A rigid Boolean algebra that admits the elimination of Q

Using ♦, we construct a rigid atomless Boolean algebra that has no uncountable antichain and that admits the elimination of the Malitz quantifier Q1.

Boolean Algebra and the Yijing

There would seem to be a significant degree of interest in the Yi Jing from computer literate people. The number of web sites devoted to the changes is substantial (see the web site listed as [ICh98] in Section 7 for a comprehensive selection of crossreferences) and there are a wide range of Yi Jing consultation programs available, as freeware, shareware and commercial software. There is also a...

Ternary Boolean Algebra

Boolean Algebra Approximations

Knight and Stob proved that every low4 Boolean algebra is 0-isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0-isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0-isomorphic to any computable Boolean algebra. It is worth remarking that, because of the machinery developed, the proof u...

The Extension of an Arbitrary Boolean Algebra to an Implicative Boolean Algebra